Pooling semilattices and non-adaptive pooling designs
نویسندگان
چکیده
In Huang and Weng (2004), Huang and Weng introduced pooling spaces, and constructed pooling designs from a pooling space. In this paper, we introduce the concept of pooling semilattices and prove that a pooling semilattice is a pooling space, then show how to construct pooling designs from a pooling semilattice. Moreover, we give many examples of pooling semilattices and thus obtain the corresponding pooling designs. © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
Pooling spaces and non-adaptive pooling designs
A pooling space is defined to be a ranked partially ordered set with atomic intervals. We show how to construct non-adaptive pooling designs from a pooling space. Our pooling designs are e-error detecting for some e; moreover e can be chosen to be very large compared with the maximal number of defective items. Eight new classes of nonadaptive pooling designs are given, which are related to the ...
متن کاملA Convolutional Neural Network based on Adaptive Pooling for Classification of Noisy Images
Convolutional neural network is one of the effective methods for classifying images that performs learning using convolutional, pooling and fully-connected layers. All kinds of noise disrupt the operation of this network. Noise images reduce classification accuracy and increase convolutional neural network training time. Noise is an unwanted signal that destroys the original signal. Noise chang...
متن کاملPooling spaces associated with finite geometry
Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 (2000) 171–182], the notion of pooling spaces was introduced [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163–169] for ...
متن کاملNew constructions of non-adaptive and error-tolerance pooling designs
We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be -error-detecting and thus -error-correcting, where , a positive integer, is the maximum number of defectives (or positives). Hence, the number of errors which can be detected grows linearly with the number of positives. Also, this construction induces a construction of a binary code with minimum Hammin...
متن کاملA class of error-correcting pooling designs over complexes
As a generalization of d-disjunct matrices and (w, r;d)-cover-freefamilies, the notion of (s, l)-disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w, r, d)cover-free-families form a class of (s, l)-disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s, l)-disjunct matrices is considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 320 شماره
صفحات -
تاریخ انتشار 2014